package LBT;

public class BinaryTreeTest {
    public static void main(String[] args) {
        char[] ch = {'W','Y','C' ,'2', '0','2', '0', '*','2', '3', '*','*','2', '1', '*','&'};
        CreateBinaryTree a = new CreateBinaryTree();
        BinaryTreeNode root = new BinaryTreeNode();
        root = a.add(ch);//构造二叉树
        System.out.println("通过层序遍历，输出结果为:");
        CreateBinaryTree.level(root);
    }
}
